Multiple Bytes Differential Fault Analysis on CLEFIA

نویسندگان

  • Xin-jie Zhao
  • Tao Wang
  • Jing-zhe Gao
چکیده

This paper examines the strength of CLEFIA against multiple bytes differential fault attack. Firstly, it presents the principle of CLEFIA algorithm and differential fault analysis; then, according to injecting faults into the r,r1,r-2 CLEFIA round three conditions, proposes three fault models and corresponding analysis methods; finally, all of the fault model and analysis methods above have been verified through software simulation. Experiment results demonstrate that: CLEFIA is vulnerable to differential fault attack due to its Feistel structure and S-box feature, 5-6,6-8,2 faults are needed to recover CLEFIA-128 based on the three fault models in this paper respectively, multiple byte faults model can greatly improve the attack practicality and even the attack efficiency, and the fault analysis methods in this paper can provide some fault analysis ideas on other block ciphers using S-box

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Optimality of Differential Fault Analyses on CLEFIA

Differential Fault Analysis is a powerful cryptanalytic tool to reveal secret keys of cryptographic algorithms. By corrupting the computation of an algorithm, an attacker gets additional information about the secret key. In 2012, several Differential Fault Analyses on the AES cipher were analyzed from an informationtheoretic perspective. This analysis exposed whether or not the leaked informati...

متن کامل

Protecting Last Four Rounds of CLEFIA is Not Enough Against Differential Fault Analysis

In this paper we propose a new differential fault analysis (DFA) on CLEFIA of 128-bit key. The proposed attack requires to induce byte faults at the fourteenth round of CLEFIA encryption. The attack uses only two pairs of fault-free and faulty ciphertexts and uniquely determines the 128-bit secret key. The attacker does not need to know the plaintext. The most efficient reported fault attack on...

متن کامل

Efficiency of Cryptography for Multi-Algorithm Computation on Dedicated Structures

Currently, the more efficient implementations for cryptographic engines are dedicated structures and only allow processing a single algorithm. On the other hand the existing multi-algorithm processors impose significantly higher costs, resulting in low efficiency structures. One possible solution is to use reconfigurable systems. However reconfigurable technologies impose additional costs, both...

متن کامل

Further Improved Differential Fault Analysis on Camellia by Exploring Fault Width and Depth

In this paper, we present two further improved differential fault analysis methods on Camellia by exploring fault width and depth. Our first method broadens the fault width of previous Camellia attacks, injects multiple byte faults into the r round left register to recover multiple bytes of the r round equivalent key, and obtains Camellia-128,192/256 key with at least 8 and 12 faulty ciphertext...

متن کامل

Relaxed Differential Fault Analysis of SHA-3

In this paper, we propose a new method of differential fault analysis of SHA-3 which is based on the differential relations of the algorithm. Employing those differential relations in the fault analysis of SHA-3 gives new features to the proposed attacks, e.g., the high probability of fault detection and the possibility of re-checking initial faults and the possibility to recover internal state...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2010  شماره 

صفحات  -

تاریخ انتشار 2010